- representing sets
- представление множеств
English-Russian dictionary of computer science. 2015.
representing sets
Смотреть что такое "representing sets" в других словарях:
Near sets — are disjoint sets that resemble each other. Resemblance between disjoint sets occurs whenever there are observable similarities between the objects in the sets. Similarity is determined by comparing lists of object feature values. Each list of… … Wikipedia
Field of sets — Set algebra redirects here. For the basic properties and laws of sets, see Algebra of sets. In mathematics a field of sets is a pair where X is a set and is an algebra over X i.e., a non empty subset of the power set of X closed under the… … Wikipedia
List of Pokémon Trading Card Game sets — This is a list of expansion sets for the Pokémon Trading Card Game. Contents 1 Wizards of the Coast 1.1 The First Generation Sets 1.1.1 Base Set 1.1.2 Jungle … Wikipedia
Creative and productive sets — In computability theory, productive sets and creative sets are types of sets of natural numbers that have important applications in mathematical logic. They are a standard topic in mathematical logic textbooks such as Soare (1987) and Rogers… … Wikipedia
Bit array — A bit array (or bitmap, in some cases) is an array data structure which compactly stores individual bits (boolean values). It implements a simple set data structure storing a subset of {1,2,..., n } and is effective at exploiting bit level… … Wikipedia
Euler diagram — Euler diagrams or Euler circles are a diagrammatic means of representing sets and their relationships. They are the modern incarnation of Euler circles, which were invented by Leonhard Euler in the 18th century. Overview Euler diagrams usually… … Wikipedia
Mathematical diagram — This article is about general diagrams in mathematics. For diagrams in the category theoretical sense, see Diagram (category theory). Euclid s Elements, ms. from Lüneburg, A.D. 1200 Mathematical diagrams are diagrams in the field of mathematics,… … Wikipedia
Jensen's covering theorem — In set theory, Jensen s covering theorem states that if 0# does not exist then every uncountable set of ordinals is contained in a constructible set of the same cardinality. Informally this conclusion says that the constructible universe is close … Wikipedia
Bloom filter — The Bloom filter, conceived by Burton H. Bloom in 1970, is a space efficient probabilistic data structure that is used to test whether an element is a member of a set. False positives are possible, but false negatives are not. Elements can be… … Wikipedia
Ganglia (software) — Infobox Software name = Ganglia caption = author = developer = released = latest release version = 3.1.0 latest release date = July 30, 2008 latest preview version = latest preview date = operating system = Cross platform platform = language =… … Wikipedia
Venn diagram — noun A diagram representing sets by circles or ellipses (and sometimes also the universal set as a rectangle enclosing all of these shapes) and indicating the relationships between the sets … Wiktionary
